Boolean satisfiability problem

Results: 324



#Item
181Logic in computer science / Constraint programming / Operations research / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Maximum satisfiability problem / Local search / Stochastic optimization / Theoretical computer science / Applied mathematics / Mathematics

L:/Documents and Settings/Administrator/My Documents/Reseach/Gecco 2008 Abstract/t07pap188-qasem.dvi

Add to Reading List

Source URL: eprints.soton.ac.uk

Language: English - Date: 2009-12-08 14:52:22
182NP-complete problems / Automated theorem proving / Logic puzzles / Recreational mathematics / Constraint programming / Sudoku / Constraint satisfaction / Boolean satisfiability problem / Unit propagation / Mathematics / Theoretical computer science / Applied mathematics

Sudoku as a SAT Problem Inˆes Lynce IST/INESC-ID, Technical University of Lisbon, Portugal [removed] Jo¨el Ouaknine

Add to Reading List

Source URL: anytime.cs.umass.edu

Language: English - Date: 2005-11-17 08:28:24
183Constraint programming / Model theory / Automated theorem proving / Logic in computer science / NP-complete problems / Boolean satisfiability problem / Constraint satisfaction / Satisfiability / Interpretation / Theoretical computer science / Mathematical logic / Mathematics

A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, and Marco Maratea MRG-DIST, University of Genova viale Francesco Causa, 13

Add to Reading List

Source URL: www.satisfiability.org

Language: English - Date: 2014-01-20 06:08:37
184Logic in computer science / Population genetics / 2-satisfiability / Fitness landscape / Boolean satisfiability problem / NK model / Solubility / Theoretical computer science / Mathematics / Applied mathematics

JEONG HAN KIM, Microsoft Research Phase Transitions in a random NK landscape Model and a random 3-SAT problem We analyze the satisfiability problem of a certain random 3-SAT problem in which the appearances of 3-clauses

Add to Reading List

Source URL: cms.math.ca

Language: English - Date: 2006-07-10 21:18:21
185Automated theorem proving / Boolean algebra / NP-complete problems / Constraint programming / Logic in computer science / Boolean satisfiability problem / Davis–Putnam algorithm / Satisfiability / Unit propagation / Theoretical computer science / Mathematics / Computational complexity theory

Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2013-07-29 01:10:58
186Logic in computer science / Boolean algebra / Complexity classes / NP-complete problems / Conjunctive normal form / Computational problems / 2-satisfiability / Boolean satisfiability problem / Disjunctive normal form / Theoretical computer science / Computational complexity theory / Applied mathematics

On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan

Add to Reading List

Source URL: www.cs.uic.edu

Language: English - Date: 2013-12-21 14:10:02
187NP-complete problems / Logic puzzles / Recreational mathematics / Constraint programming / Logic in computer science / 2-satisfiability / Sudoku / Constraint satisfaction / Boolean satisfiability problem / Theoretical computer science / Mathematics / Computational complexity theory

The Chaos Within Sudoku M´ aria Ercsey-Ravasz1, ∗ and Zolt´an Toroczkai2, 3, † arXiv:1208.0370v1 [nlin.CD] 1 Aug 2012

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-08-02 20:18:34
188Mathematical logic / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Constraint satisfaction / Satisfiability / Theoretical computer science / Constraint programming / Mathematics

MICHAEL MOLLOY, University of Toronto Sharp Thresholds in Random Constraint Satisfaction Problems We consider a wide family of models for random constraint satisfaction problems. This family includes random k-SAT, random

Add to Reading List

Source URL: cms.math.ca

Language: English - Date: 2006-07-10 21:18:21
189Constraint programming / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Solver / Constraint satisfaction problem / Theoretical computer science / Applied mathematics / Mathematics

metaSMT: Focus On Your Application Not On Solver Integration Finn Haedicke Stefan Frehse

Add to Reading List

Source URL: www.informatik.uni-bremen.de

Language: English - Date: 2011-09-06 04:07:56
190Automata theory / Logic in computer science / Model theory / Complexity classes / Electronic design automation / Satisfiability / FO / Boolean satisfiability problem / Constraint automaton / Theoretical computer science / Mathematical logic / Mathematics

The Effects of Bounding Syntactic Resources on Presburger LTL ∗ St´ephane Demri LSV, ENS Cachan CNRS, INRIA Saclay [removed]

Add to Reading List

Source URL: www.lsv.ens-cachan.fr

Language: English - Date: 2009-06-18 03:59:48
UPDATE